RDF-TR: Exploiting structural redundancies to boost RDF compression
نویسندگان
چکیده
منابع مشابه
Graphium Chrysalis: Exploiting Graph Database Engines to Analyze RDF Graphs
We present Graphium Chrysalis, a tool to visualize the main graph invariants that characterize RDF graphs, i.e., graph properties that are independent of the graph representation such as, vertex and edge counts, inand out-degree distribution, and in-coming and out-going h-index. Graph invariants characterize a graph and impact on the cost of the core graph-based tasks, e.g., graph traversal and...
متن کاملScalable RDF Data Compression using X10
The Semantic Web comprises enormous volumes of semi-structured data elements. For interoperability, these elements are represented by long strings. Such representations are not efficient for the purposes of Semantic Web applications that perform computations over large volumes of information. A typical method for alleviating the impact of this problem is through the use of compression methods t...
متن کاملGraph Pattern Based RDF Data Compression
The growing volume of RDF documents and their inter-linking raise a challenge on the storage and transferring of such documents. One solution to this problem is to reduce the size of RDF documents via compression. Existing approaches either apply well-known generic compression technologies but seldom exploit the graph structure of RDF documents. Or, they focus on minimized compact serialisation...
متن کاملScalable RDF data compression with MapReduce
The Semantic Web contains many billions of statements, which are released using the resource description framework (RDF) data model. To better handle these large amounts of data, high performance RDF applications must apply a compression technique. Unfortunately, because of the large input size, even this compression is challenging. In this paper, we propose a set of distributed MapReduce algor...
متن کاملExploiting Emergent Schemas to Make RDF Systems More Efficient
We build on our earlier finding that more than 95% of the triples in actual RDF triple graphs have a remarkably tabular structure, whose schema does not necessarily follow from explicit metadata such as ontologies, but for which an RDF store can automatically derive by looking at the data using so-called “emergent schema” detection techniques. In this paper we investigate how computers and in p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2020
ISSN: 0020-0255
DOI: 10.1016/j.ins.2019.08.081